Proximity to ℓ1and Distortion in Asymptotic L1Spaces
نویسندگان
چکیده
منابع مشابه
Proximity to l1 and Distortion in Asymptotic l1 Spaces
For an asymptotic l1 space X with a basis (xi) certain asymptotic l1 constants, δα(X) are defined for α < ω1. δα(X) measures the equivalence between all normalized block bases (yi) k i=1 of (xi) which are Sα-admissible with respect to (xi) (Sα is the α -Schreier class of sets) and the unit vector basis of l 1 . This leads to the concept of the delta spectrum of X , ∆(X), which reflects the beha...
متن کاملBest proximity point theorems in Hadamard spaces using relatively asymptotic center
In this article we survey the existence of best proximity points for a class of non-self mappings which satisfy a particular nonexpansiveness condition. In this way, we improve and extend a main result of Abkar and Gabeleh [A. Abkar, M. Gabeleh, Best proximity points of non-self mappings, Top, 21, (2013), 287-295] which guarantees the existence of best proximity points for nonex...
متن کاملTail Distortion Risk and Its Asymptotic Analysis
A distortion risk measure used in finance and insurance is defined as the expected value of potential loss under a scenario probability measure. In this paper, the tail distortion risk measure is introduced to assess tail risks of excess losses modeled by the right tails of loss distributions. The asymptotic linear relation between tail distortion and Value-at-Risk is derived for heavy tailed l...
متن کاملAsymptotic Performance of Vector Quantizers with a Perceptual Distortion Measure
Gersho’s bounds on the asymptotic performance of vector quantizers are valid for vector distortions which are powers of the Euclidean norm. Yamada, Tazaki and Gray generalized the results to distortion measures that are increasing functions of the norm of their argument. In both cases, the distortion is uniquely determined by the vector quantization error, i.e., the Euclidean difference between...
متن کاملAsymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks
This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 1997
ISSN: 0022-1236
DOI: 10.1006/jfan.1997.3106